Acute Triangulations of Pentagons

نویسنده

  • Liping Yuan
چکیده

An acute triangulation is a triangulation whose triangles have all their angles less than π 2 . In this paper we prove that i) every planar pentagon can be triangulated into at most 54 acute triangles, and ii) every double pentagon can be triangulated into at most 76 acute triangles.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pentagon Contact Representations

Representations of planar triangulations as contact graphs of a set of internally disjoint homothetic triangles or respectively of a set of internally disjoint homothetic squares have received quite some attention in recent years. In this paper we investigate representations of planar triangulations as contact graphs of a set of internally disjoint homothetic pentagons. Surprisingly such a repr...

متن کامل

Acute Triangulations of Polyhedra and R

We study the problem of acute triangulations of convex polyhedra and the space R. Here an acute triangulation is a triangulation into simplices whose dihedral angles are acute. We prove that acute triangulations of the n-cube do not exist for n≥4. Further, we prove that acute triangulations of the space R do not exist for n≥5. In the opposite direction, in R, we present a construction of an acu...

متن کامل

Acute triangulations of polyhedra and ℝ N

We study the problem of acute triangulations of convex polyhedra and the space Rn. Here an acute triangulation is a triangulation into simplices whose dihedral angles are acute. We prove that acute triangulations of the n–cube do not exist for n ≥ 4. Further, we prove that acute triangulations of the space Rn do not exist for n ≥ 5. In the opposite direction, in R3, we present a construction of...

متن کامل

Computing Acute and Non-obtuse Triangulations

We propose a method for computing acute (non-obtuse) triangulations. That is, for a given two dimensional domain (a set of points or a planar straight line graph), we compute a triangulation of the domain such that all angles are less than (or less than or equal to) π/2. This leads to the first software to compute such triangulations.

متن کامل

Acute triangulations of the regular dodecahedral surface

In this paper we consider geodesic triangulations of the surface of the regular dodecahedron. We are especially interested in triangulations with angles not larger than π/2, with as few triangles as possible. The obvious triangulation obtained by taking the centres of all faces consists of 20 acute triangles. We show that there exists a geodesic triangulation with only 10 non-obtuse triangles, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010